منابع مشابه
A Polling Model with Retrial Customers
A polling model with n stations and switchover times is considered. The customers are of n different types, arrive to the system according to the Poisson distribution in batches of random size, and if they find the server unavailable, they start to make retrials until succeed to find a position for service. Each batch may contain customers of different types while the numbers of customers belon...
متن کاملA polling model with smart customers
In this paper we consider a single-server, cyclic polling system with switch-over times. A distinguishing feature of the model is that the rates of the Poisson arrival processes at the various queues depend on the server location. For this model we study the joint queue length distribution at polling epochs and departure epochs. We also study the marginal queue length distribution at arrival ep...
متن کاملPolling Systems with Positive and Negative Customers
We study Polling Systems (POLS) with both positive and negative customers, a direction not yet pursued in the literature on POLS. We analyze the Gated, Exhaustive and Globally-Gated service regimes and derive expressions for the Probability Generating Functions (PGFs) of the system’s states and for the Laplace-Stieltjes Transforms of the waiting times. Since the transforms depend on an unknown ...
متن کاملPerishable Inventory Model with Retrial Demands, Negative Customers and Multiple Working Vacations
This paper presents the analysis of a continuous review perishable inventory system wherein the life time of each item follows an exponential distribution. The operating policy is (s,S) policy where the ordered items are received after a random time which follows exponential distribution. Primary arrival follows Poisson distribution and they may turnout to be posit...
متن کاملA Tandem Queue with Two Markovian Inputs and Retrial Customers
A tandem retrial queue consisting of two stations is studied. The first station has a single server. An input flow at the first station is described by the Markovian Arrival Process ( MAP ). If a customer from this flow meets the busy server, it goes to the orbit of infinite size and tries its luck later on in exponentially distributed random time. The service time distribution at the first sta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1997
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.40.489